Algorithm Evolution for Signal Understanding
نویسنده
چکیده
Automated program evolution has existed in some form for over thirty years. Signal understanding (e.g., signal classification) has been a scientific concern for even longer than that. Interest in generating, through machine learning techniques, a general signal understanding system is a newer topic, but has recently attracted considerable attention. First, I have proposed to define and create a machine learning mechanism for generating signal understanding systems independent of the signal's type and size. Second, I have proposed to do this through an evolutionary strategy that is an extension of genetic programming. Third, I have proposed to introduce a suite of sub-mechanisms that not only contribute to the power of the thesis mechanism, but are also contributions to the understanding of the learning technique developed and genetic programming in general. Existing machine learning techniques have both advantages and disadvantages in their solutions to the general signal-tosymbol problem. Concretely, the goal of this thesis work is to overcome some of these disadvantages without losing any of the important advantages of existing systems. Two particularly prominent disadvantages of existing machine learning techniques for signal understanding are that the input must almost always be preprocessed and that domain knowledge must be input in the form of preprocessing or technical details that are not obvious to a signal expert. These two disadvantages can be avoided by the evolution of programs that use parameterized signal primitives. Three prominent advantages of existing machine learning techniques for signal understanding are: that "real-world" signals can be handled; that, even when learning must be done off l ine, the learned function can be run in real time; and that the technique mechanisms are well understood, thereby generating faith in the method. One of the thesis goals is to transfer these advantages to the evolution of algorithms. My thesis work involves iteratively improving the representation, evolutionary environment, and coordination of evolved programs. These evolved programs are each expected to learn to discriminate one signal type from all others in a set of signal training examples. Then multiple, highly fit programs from each discrimination pool are orchestrated in a signal understanding system. I have called this paradigm PADO: Parallel
منابع مشابه
Implementation of Face Recognition Algorithm on Fields Programmable Gate Array Card
The evolution of today's application technologies requires a certain level of robustness, reliability and ease of integration. We choose the Fields Programmable Gate Array (FPGA) hardware description language to implement the facial recognition algorithm based on "Eigen faces" using Principal Component Analysis. In this paper, we first present an overview of the PCA used for facial recognition,...
متن کاملA Novel Methodology for Structural Matrix Identification using Wavelet Transform Optimized by Genetic Algorithm
With the development of the technology and increase of human dependency on structures, healthy structures play an important role in people lives and communications. Hence, structural health monitoring has been attracted strongly in recent decades. Improvement of measuring instruments made signal processing as a powerful tool in structural heath monitoring. Wavelet transform invention causes a g...
متن کاملWell Placement Optimization Using Differential Evolution Algorithm
Determining the optimal location of wells with the aid of an automated search algorithm is a significant and difficult step in the reservoir development process. It is a computationally intensive task due to the large number of simulation runs required. Therefore,the key issue to such automatic optimization is development of algorithms that can find acceptable solutions with a minimum numbe...
متن کاملMulti-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
متن کاملTask Scheduling Algorithm Using Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in Cloud Computing
The cloud computing is considered as a computational model which provides the uses requests with resources upon any demand and needs.The need for planning the scheduling of the user's jobs has emerged as an important challenge in the field of cloud computing. It is mainly due to several reasons, including ever-increasing advancements of information technology and an increase of applications and...
متن کاملBlind Signal Separation Using an Extended Infomax Algorithm
The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...
متن کامل